Sequential clustering: tracking down the most natural clusters

نویسندگان

  • Thomas Ott
  • Albert Kern
  • Ruedi Stoop
چکیده

Sequential superparamagnetic clustering (SSC) is a substantial extension of the superparamagnetic clustering approach (SC). We demonstrate that the novel method is able to master the important problem of inhomogeneous classes in the feature space. By fully exploiting the non-parametric properties of SC, the method is able to find the natural clusters even if they are highly different in shape and density. In such situations, concurrent methods normally fail. We present the results from a fully automated implementation of SSC (applications to chemical data and visual scene analysis) and provide analytical evidence of why the method works.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Target Tracking Based on Virtual Grid in Wireless Sensor Networks

One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...

متن کامل

Does Fundraising Have Meaningful Sequential Patterns? The Case of Fintech Startups

Nowadays, fundraising is one of the most important issues for both Fintech investors and startups. The pattern of fundraising in terms of “number and type of rounds and stages needed” are important. The diverse features and factors that could stem from Fintech business models which can influence success are of the key issues in shaping these patterns. This study applied the top 100 KPMG Fintech...

متن کامل

Tracking evolving communities in large linked networks.

We are interested in tracking changes in large-scale data by periodically creating an agglomerative clustering and examining the evolution of clusters (communities) over time. We examine a large real-world data set: the NEC CiteSeer database, a linked network of >250,000 papers. Tracking changes over time requires a clustering algorithm that produces clusters stable under small perturbations of...

متن کامل

خوشه‌بندی داده‌ها بر پایه شناسایی کلید

Clustering has been one of the main building blocks in the fields of machine learning and computer vision. Given a pair-wise distance measure, it is challenging to find a proper way to identify a subset of representative exemplars and its associated cluster structures. Recent trend on big data analysis poses a more demanding requirement on new clustering algorithm to be both scalable and accura...

متن کامل

Using Natural Clusters Information to Build Fuzzy Indexing Structure

Efficient and accurate information retrieval is one of the main issues in multimedia databases. However, the key for this is how to build an efficient indexing structure. In this paper, we demonstrate how to use a fuzzy clustering algorithm, Sequential Fuzzy Competitive Clustering (SFCC), to get the natural clusters information from the data. Then use the information to build an efficient index...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005